Mean-Curvature Flow of Voronoi Diagrams
نویسندگان
چکیده
We study the evolution of grain boundary networks by the mean-curvature flow under the restriction that the networks are Voronoi diagrams for a set of points. For such evolution we prove a rigorous universal upper bound on the coarsening rate. The rate agrees with the rate predicted for the evolution by mean-curvature flow of the general grain boundary networks, namely that the typical grain area grows linearly in time. We perform numerical simulations which provide evidence that the dynamics achieves the rate of coarsening that agrees with the upper bound in terms of scaling.
منابع مشابه
Simplified Abstract Voronoi Diagrams
We present a simplified system of axioms for Abstract Voronoi Diagrams that should pave the way for new applications in theory and practice.
متن کاملMean Curvature Skeletons
Inspired by recent developments in contraction-based curve skeleton extraction, we formulate the skeletonization problem via mean curvature flow (MCF). While the classical application of MCF is surface fairing, we take advantage of its area-minimizing characteristic to drive the curvature flow towards the extreme so as to collapse the input mesh geometry and obtain a skeletal structure. By anal...
متن کاملVoronoi diagrams in a river
A new generalized Voronoi diagram is defined on the surface of a river with unifonn flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram can be obtained from the ordinary Voronoi diagram by a certain transformation, whereas if ...
متن کاملNew Results on Abstract Voronoi Diagrams
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...
متن کاملComputing transportation Voronoi diagrams in optimal time
We present the first time-optimal algorithm for computing the Voronoi Diagram under the metric induced by a transportation network with discrete entry and exit points. For input with n sites, k stations, and e transportation lines, the algorithm computes the Voronoi Diagram in O ( (n+ k) log(n+ k) + e ) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Nonlinear Science
دوره 25 شماره
صفحات -
تاریخ انتشار 2015